Lattice Spanners of Low Degree
نویسندگان
چکیده
Let δ0(P, k) denote the degree k dilation of a point set P in the domain of plane geometric spanners. If Λ is the infinite square lattice, it is shown that 1+ √ 2 ≤ δ0(Λ, 3) ≤ (3+2 √ 2) 5−1/2 = 2.6065 . . . and δ0(Λ, 4) = √ 2. If Λ is the infinite hexagonal lattice, it is shown that δ0(Λ, 3) = 1 + √ 3 and δ0(Λ, 4) = 2. All our constructions are planar lattice tilings constrained to degree 3 or 4.
منابع مشابه
Towards Plane Spanners of Degree 3
Let S be a finite set of points in the plane that are in convex position. We present an algorithm that constructs a plane 3+4π 3 -spanner of S whose vertex degree is at most 3. Let Λ be the vertex set of a finite non-uniform rectangular lattice in the plane. We present an algorithm that constructs a plane 3 √ 2-spanner for Λ whose vertex degree is at most 3. For points that are in the plane and...
متن کاملNew Doubling Spanners: Better and Simpler
In a seminal STOC’95 paper, Arya et al. conjectured that spanners for low-dimensional Euclidean spaces with constant maximum degree, hop-diameter O(logn) and lightness O(logn) (i.e., weight O(logn)· w(MST)) can be constructed in O(n logn) time. This conjecture, which became a central open question in this area, was resolved in the affirmative by Elkin and Solomon in STOC’13 (even for doubling m...
متن کاملComparison of Geometric Spanner Construction Methods for Network Applications
There are a number of applications of geometric spanners in wireless, wired and sensor networks, including decentralized low-state routing in wireless ad hoc networks, locality-aware overlays on the internet and broadcast and multicast via flooding. A number of different methods have been developed for constructing spanners, which all have low stretch but differ in other properties such as degr...
متن کاملOn Spanners and Lightweight Spanners of Geometric Graphs
We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane. We are particularly interested in spanners that possess useful properties such as planarity, bounded degree, and/or light weight. Such spanners have been extensively studied in the area of computational geometry and have been used as the building block for constructin...
متن کاملFast Deterministic Distributed Algorithms for Sparse Spanners
This paper concerns the efficient construction of sparse and low stretch spanners for unweighted arbitrary graphs with n nodes. All previous deterministic distributed algorithms, for constant stretch spanners of o(n2) edges, have a running time Ω(n ) for some constant > 0 depending on the stretch. Our deterministic distributed algorithms construct constant stretch spanners of o(n2) edges in o(n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Math., Alg. and Appl.
دوره 8 شماره
صفحات -
تاریخ انتشار 2016